transition function造句

• To compute the transition function
  中的算法来计算转换函数。
• You can represent the transition function as a two dimensional matrix ,
  可以将转换函数表示为两维矩阵
• Finite - state vector quantization ; lpc cepstral coefficients ; dynamic spectral feature ; dynamic time warpping ; state transition function
  有限状态矢量量化lpc倒谱系数动态谱特性动态规整状态转移函数
• The requirements of the initial system state and the secure system state are put forward and 21 transition functions are defined in this dissertation
  给出了初始系统状态和系统的安全状态要求，定义了21个状态转换函数。
• In other words , to build the dfa , you need to allocate as many states as there are possible stack configurations and compute the transition function between all these states
  换句话说，要构建dfa ，需要分配的状态数量与可能的堆栈配置数量相同，并且需要计算所有这些状态间的转换函数。
• Invariant distribution is a greatly important property of standard transition function in continuous - time markov chains and jump processes , it is of considerably significnce to study it
  不变分布是连续时间马氏链中标准转移函数及跳过程的一个重要性质，对不变分布的讨论有着十分重要的意义。
• On the base of li ' s paper [ 41 ] , we first discuss the relationships between q - matrix q and the generators of positive once integrated semigroups on derived from transition functions
  Li 41的基础上，我们首先讨论由转移函数导出的l 。上的正的一次压缩半积分群的生成元与q矩阵q之间的关系；其次，我们该讨论问题的反面：给定l 。
• 2 ) we put up the experiments mainly based on the cpld for the faults emulation on some typical digital circuits . and we built the transition function databases according to the faulty testing results
  2 、以cpld为核心进行了一些典型数字电路的故障模拟仿真试验，建立被测电路的状态转移函数集，为进一步研究电路的可测试性和故障诊断提供了数据。
• An easy checking criterion for a minimal monotone transition function to be strongly ergodic is then obtained . we further prove that a non - minimal ergodic monotone transition function is always strongly ergodic
  对于最小随机单调转移函数的强遍历，给出了非常容易检验的准则，此外，我们还证明了非最小随机单调转移函数强遍历当且仅当它是遍历的。
• 4 ) in this paper , according to the transition function databases we got the minimum test set using the graph theory . and later we built the quick test databases and the fault diagnosis databases
  4 、重点研究了利用图论中的基本回路概念根据状态转移函数集寻找电路的最小测试集，然后利用所得的最小测试集建立相应电路的快速测试数据库和故障诊断字典。
• The algorithm processes the set of xpaths and compiles three things : a set of states that the transition diagram might go through , the transition function to move from one state to another , and an indication of which states mark successful recognition of an xpath
  该算法处理这组xpath ，并编译三样东西：转换图可能经过的一组状态，从一种状态迁移到另一种状态的转换函数，以及表明哪些状态成功地识别了xpath的标记。
• Li in [ 41 ] has discussed the properties of transition functions on and obtained that a generally unlimited q - matrix q can generate a positive once integrated semigroup with contractions on up to now , it is the first time to apply the theories of integrated semigroups to ctmcs
  上的性质，得出一般的无界q矩阵q在l 。上能生成正的一次压缩积分半群迄今为止，这是首次应用积分半群的理论来研究时间连续markov链
• Then we also formulate the model of computing with values via lattice - valued finite state automata , as well as the state transition function of the model of computing with words via lattice - valued finite state automata and the language accepted by lattice - valued finite automata
  然后,给出了基于格值有限状态自动机的数值计算的形式模型。同时,建立了输入是词的格值有限状态自动机的转移函数以及格值有限状态自动机所接收的语言的定义。
• According to the theory of continuous - time markov chains , given a g - matrix q , it is possible that there exist infinite transition functions and therefore there maybe exist infinite positive contraction semigroups ( co semigroups ) on l1 derived from q - matrix q . but each positive contraction semigroup has and only has one infinitesimal generator
  给定一个q -矩阵q ，可能存在无穷多个转移函数，从而在l1空间上可能有无穷多个正的压缩半群( c _ 0半群)与之对应，而每个正的压缩半群有且仅有一个无穷小生成元。
• Chapter 5 is contributed to studying convergence rate of standard transition function and relation of all kinds of convergence rates . by revealing the close link among strong ergodicity , stochastically monotone , and the feller transition functions we are able to prove that a monotone ergodic transition function is strongly ergodic if and only if it is not a feller transition function
  第五章讨论标准转移函数的收敛速度以及各种收敛速度之间的关系，通过找出强遍历、随机单调性和feller转移函数之间的紧密关系，我们证明了随机单调标准转移函数是强遍历的充要条件是它不是feller转移函数。